Locally homogeneous graphs with dense links at vertices
نویسندگان
چکیده
منابع مشابه
COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملLocally Homogeneous Graphs
For a connected graph G and point v of G, let G, be the subgraph induced by the points adjacent to v . This G is called locally Go if G, = Go for all points v of G. A graph is called locally homogeneous if it is locally Go for some Go. Recent work concerning local homogeneity has focused on two broad questions. First, for which Go does there exist a G that is locally Go? This has been settled f...
متن کاملcospectrality measures of graphs with at most six vertices
cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. actually,the origin of this concept came back to richard brualdi's problems that are proposed in cite{braldi}:let $g_n$ and $g'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2 g...
متن کاملSome Properties of Locally Homogeneous Graphs
In this paper we determine when the join of two graphs is locally homogeneous. It is shown that the Cartesian product of a locally H1 graph and a locally H2 graph is locally (H1∪ H2). All graphs H of order at most 4 for which there are no locally H graphs are determined.
متن کاملColoring Vertices and Faces of Locally Planar Graphs
If G is an embedded graph, a vertex-face r-coloring is a mapping that assigns a color from the set {1, . . . , r} to every vertex and every face of G such that different colors are assigned whenever two elements are either adjacent or incident. Let χvf (G) denote the minimum r such that G has a vertex-face r-coloring. Ringel conjectured that if G is planar, then χvf (G) ≤ 6. A graph G drawn on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1992
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1992.128344